Dagster: Parallel Structured Search

We demonstrate Dagster, a system that implements new approach to scheduling interdependent (Boolean) SAT search activities in high-performance computing (HPC) environments. Our takes as input set of disjunctive clauses (i.e., DIMACS CNF) and labelled directed acyclic graph (DAG) structure describing how the are decomposed into interrelated problems. Component problems solved using standard systematic backtracking search, which may optionally be coupled (stochastic dynamic) local and/or clause-strengthening processes. Dagster Graph Maximal Determinant combinatorial case study. This demonstration paper presents study, is adjunct longer accepted manuscript at Pacific Rim International Conference on Artificial Intelligence (2022).